Structural bias in population-based algorithms
نویسندگان
چکیده
منابع مشابه
Structural bias in population-based algorithms
Challenging optimisation problems are abundant in all areas of science and industry. Since the 1950s, scientists have responded to this by developing everdiversifying families of ’black box’ optimisation algorithms. The latter are designed to be able to address any optimisation problem, requiring only that the quality of any candidate solution can be calculated via a ’fitness function’ specific...
متن کاملAn Optimization Algorithms-based Approach to District Health System Population Areas in Iran
Background: One of important subject in the operations' management fields is partitioning matter that was investigated in the study. This topic has recently received more attention from researchers of the healthcare management systems' field. This subject is important because planning about improvement of the healthcare system structure is considered as one of the most important management prob...
متن کاملStructural bias in phonology
Chomsky and Halle (1968) propose an Evaluation Procedure that prefers featurally simple rules and grammars, and Bach and Harms (1972) propose that this bias for structural simplicity can explain instances of historical change in terms of rule simplication in learning. In this talk, I discuss an alternative model of structural bias (Pater and Moreton 2012) cast in a Maximum Entropy framework (Go...
متن کاملHash-Based Structural Join Algorithms
Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many requirements, e. g., guarantee linear worst-case runtime; generate sorted, duplicate-free output; adapt to fiercely varying input sizes and element distributions; enable pipelining; and (probably) more. Therefore, it is not pos...
متن کاملPopulation-based Monte Carlo algorithms
In this paper, we give a cross-disciplinary survey on “population-based” Monte Carlo algorithms. These algorithms consist of a set of “walkers” or “particles” for the representation of a high-dimensional vector and the computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2015
ISSN: 0020-0255
DOI: 10.1016/j.ins.2014.11.035